Tidy Animations of Tree Algorithms
نویسندگان
چکیده
In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In this paper we describe methods for animating tree manipulation algorithms, one of the most challenging algorithm animation domains. In particular, we animate operations on pairing heap data structures which are used to implement priority queues. Our animations use tree layout heuristics and and smooth transitions for illustrating intermediate algorithm states to promote viewer understanding. This paper describes the visual techniques and methodologies used to display the pairing heap operations. The paper also details the implementation requirements and how our particular support platform, the XTango system, facilitates meeting these requirements.
منابع مشابه
Deriving Tidy Drawings of Trees
The tree-drawing problem is to produce a `tidy' mapping of elements of a tree to points in the plane. In this paper, we derive an eecient algorithm for producing tidy drawings of trees. The speciication, the starting point for the derivations, consists of a collection of intuitively appealing criteria satissed by tidy drawings. The derivation shows constructively that these criteria completely ...
متن کاملMinimized Database of Unit Selection in Visual Speech Synthesis without Loss of Naturalness
Image-based modeling is very successful in the creation of realistic facial animations. Applications with dialog systems, such as eLearning and customer information service, can integrate facial animations with synthesized speech in websites to improve human-machine communication. However, downloading a database with 11,594 mouth images (about 120MB in JPEG format) used by talking head needs ab...
متن کاملWeak n-categories: comparing opetopic foundations
We define the category of tidy symmetric multicategories. We construct for each tidy symmetric multicategory Q a cartesian monad (EQ, TQ) and extend this assignation to a functor. We exhibit a relationship between the slice construction on symmetric multicategories, and the ‘free operad’ monad construction on suitable monads. We use this to give an explicit description of the relationship betwe...
متن کاملThe Tidy Set: A Minimal Simplicial Set for Computing Homology of Clique ComplexesI
We introduce the tidy set, a minimal simplicial set that captures the topology of a simplicial complex. The tidy set is particularly effective for computing the homology of clique complexes. This family of complexes include the Vietoris-Rips complex and the weak witness complex, methods that are popular in topological data analysis. The key feature of our approach is that it skips constructing ...
متن کاملA Pruning Neural Network Model in Credit Classification Analysis
Nowadays, credit classification models are widely applied because they can help financial decision-makers to handle credit classification issues. Among them, artificial neural networks (ANNs) have been widely accepted as the convincing methods in the credit industry. In this paper, we propose a pruning neural network (PNN) and apply it to solve credit classification problem by adopting the well...
متن کامل